We introduce the basic notions of combinatorial optimization and worst - case analysis of algorithms in chapter 1 文章首先介紹了組合優(yōu)化的概貌,給出了近似算法定義及其性能度量標準。
In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems 在第二章至第五章中,我們分別研究了四個組合優(yōu)化問題的近似算法,并給出了它們的性能分析。
Second , we tackle a np - hard problem of scheduling jobs on a bank of parallel machines with the objective of minimizing the makespan , under the constraints of non - preemption and no precedence relationship . the worst - case analysis of fpsf ( fast processing speed first ) heuristic is discussed 2 )研究并行加工系統(tǒng)對通過時間( makespan )的優(yōu)化問題( pm | | cmax問題) ,提出了新的算法,并對最壞情形作出了分析。